Classification Improvement by an Extended Depth LSA Machine
نویسندگان
چکیده
Is there any potential benefit when training threshold circuits by adding extra layers (depth) to the network? This question is investigated in a powerful recently introduced artificial intelligence system, called the Logarithmic Simulated Annealing (LSA) machine, that combines the Simulated Annealing Algorithm with a Logarithmic cooling schedule and the classical perceptron algorithm. The first and second layers are trained with the LSA machine learning algorithm. For the learning procedure 75% of the available data are used for training the first layer. The first layer consists of v voting functions of P threshold circuits each one. After training the first layer, the fixed weights are exposed again to the training data in order to produce new samples of length v that are used for training the second layer. The remaining 25% are used for testing the entire network. The main idea is to smooth in the second layer the inaccuracies of the first layer, by training the second layer to evaluate the significance of each output gate of the first layer. Results of the depth investigation reveal that adding a second layer can produce stable better results. In this work extending the depth of the network results to better improvement than extending the size of the network. Key-Words: Simulated Annealing, Optimisation, Perceptron Algorithm, Threshold Circuits, Classification, Machine Learning
منابع مشابه
On the Evaluation of Dividing Samples for Training an Extended Depth LSA Machine
A classic problem in neural networks is the depth investigation of the network. Is there any potential benefit when training depth-one threshold circuits by adding extra layers and further training them? This question is investigated in a powerful recently introduced artificial intelligence system, called the Logarithmic Simulated Annealing (LSA) machine, that combines the Simulated Annealing A...
متن کاملMining and Summarizing Movie Reviews in Mobile Environment
In this paper, we design and develop various strategies required for sentiment analysis of movie domain in mobile environment. The main objective of review mining and summarization is extracting the features on which the reviewers express their opinions and determining whether the opinions are positive or negative. The sentiment classification is done by various classifiers such as maximum entr...
متن کاملAutomatic road crack detection and classification using image processing techniques, machine learning and integrated models in urban areas: A novel image binarization technique
The quality of the road pavement has always been one of the major concerns for governments around the world. Cracks in the asphalt are one of the most common road tensions that generally threaten the safety of roads and highways. In recent years, automated inspection methods such as image and video processing have been considered due to the high cost and error of manual metho...
متن کاملEnsemble Classification and Extended Feature Selection for Credit Card Fraud Detection
Due to the rise of technology, the possibility of fraud in different areas such as banking has been increased. Credit card fraud is a crucial problem in banking and its danger is over increasing. This paper proposes an advanced data mining method, considering both feature selection and decision cost for accuracy enhancement of credit card fraud detection. After selecting the best and most effec...
متن کاملExperiments with LSA for Passage Re-Ranking in Question Answering
As in the previous QA@CLEF track, two separate groups at the University of Alicante participated this year using different approaches. This paper describes the work of Alicante 1 group. We have continued with the research line established in the past competition, where the main goal was to obtain a fully data-driven system based on machine learning techniques. Last year an XML framework was est...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 2004